Hybrid GAs for Solving the Simultaneous Discrete Berth Allocation and Dynamic Quay Crane Assignment Problems
نویسندگان
چکیده
منابع مشابه
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملRobust Scheduling for Berth Allocation and Quay Crane Assignment Problem
Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...
متن کاملA Genetic Algorithm for Berth Allocation and Quay Crane Assignment
Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...
متن کاملGenetic Algorithm for Solving Berth and Quay Cranes Assignment problems
The management of a container terminal is a complex process that involves a vast number of decisions. The berth is the most important resource that affects the capacity of the terminal. The problem is here to allocate berths to arriving vessels and to determine which cranes in the berths process the docked vessels. For creating the berth schedule, the calling schedule of vessels, favourable ber...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2019
ISSN: 2475-885X
DOI: 10.12783/dtetr/icicr2019/30546